On Quadratic Fields Generated by Discriminants of Irreducible Trinomials

نویسندگان

  • IGOR E. SHPARLINSKI
  • Wen-Ching Winnie Li
چکیده

A. Mukhopadhyay, M. R. Murty and K. Srinivas have recently studied various arithmetic properties of the discriminant ∆n(a, b) of the trinomial fn,a,b(t) = t n + at+ b, where n ≥ 5 is a fixed integer. In particular, it is shown that, under the abc-conjecture, for every n ≡ 1 (mod 4), the quadratic fields Q (√ ∆n(a, b) ) are pairwise distinct for a positive proportion of such discriminants with integers a and b such that fn,a,b is irreducible over Q and |∆n(a, b)| ≤ X, as X → ∞. We use the square-sieve and bounds of character sums to obtain a weaker but unconditional version of this result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Squarefree Discriminants of Trinomials under Abc

For an odd positive integer n ≥ 5, assuming the truth of the abc conjecture, we show that for a positive proportion of pairs (a, b) of integers the trinomials of the form tn + at + b (a, b ∈ Z) are irreducible and their discriminants are squarefree.

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Another Look at Square Roots and Traces (and Quadratic Equations) in Fields of Even Characteristic

We discuss irreducible polynomials that can be used to speed up square root extraction in fields of characteristic two. The obvious applications are to point halving methods for elliptic curves and divisor halving methods for hyperelliptic curves. Irreducible polynomials P (X) such that the square root ζ of a zero x of P (X) is a sparse polynomial are considered and those for which ζ has minima...

متن کامل

Parity of the number of irreducible factors for composite polynomials

Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The ...

متن کامل

Divisibility of Trinomials by Irreducible Polynomials over F_2

Irreducible trinomials of given degree n over F2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F2. A condition for divisibility of selfreciprocal trinomials by irreducible poly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008